Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
نویسندگان
چکیده
منابع مشابه
Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs
We exploit the close relationship between circular arc graphs and interval graphs to design efficient approximation algorithms for NP-hard Optimization problems on circular arc graphs. The problems considered here are maximum domatic partition and on-line minimum vertex coloring. We present a heuristic for the domatic partition problem with a performance ratio of 4. For on-line coloring, we con...
متن کاملAn Approximation Algorithm for Coloring Circular-arc Graphs
Consider families of arcs on a circle. The minimum coloring problem on arc families has been shown to be NP-hard by Garey, Johnson, Miller and Papadimitriou. It is easy to show that 2q colors are sufficient for any arc family F, where q is the size of a maximum clique in F and 3q/2 colors are necessary for some families. It has long been open problem to find a coloring algorithm which uses no m...
متن کاملOn k-Coloring of Weighted Circular-Arc Graphs
The problem of coloring a subgraph of any weighted circular-arc graph with a set of k colors is studied in this paper. In such a coloring, two overlapping arcs must receive different colors. Our main result is to derive a 2-approximation algorithm for the NP-hard problem of finding a maximum total weight k-colorable subgraph of any weighted circular-arc graph, and this algorithm runs in O(mloge...
متن کاملAn Approach Based on Coloring Circular-Arc Graphs
to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract In this paper we discuss a method to perform compile-time buuer allocation, allowing eecient buuer sharing among the arcs of a s...
متن کاملCertifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
We give two new algorithms for recognizing proper circulararc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00118-w